On two criteria for infinite random sequences
نویسندگان
چکیده
منابع مشابه
Selection Criteria for (Random) Generation of Digital (0,s)-Sequences
Among the very general scramblings introduced by A. Owen [Owe95], simple and widely used scramblings are obtained by S. Tezuka [Tez94]–[Tez95] by multiplying on the left the upper triangular generator matrices by nonsingular lower triangular (NLT) matrices whose entries are randomly chosen in the set of digits {0, 1, . . . , b − 1} identified to Fb. For these special scramblings we propose to s...
متن کاملExact FCFS Matching Rates for Two Infinite Multitype Sequences
Motivated by queues with multi-type servers and multi-type customers, we consider an infinite sequence of items of types C = {c1, . . . , cI}, and another infinite sequence of items of types S = {s1, . . . , sJ}, and a bipartite graph G of allowable matches between the types. We assume that the types of items in the two sequences are i.i.d. with given probability vectors α, β. Matching the two ...
متن کاملAperiodicity Measure for Infinite Sequences
We introduce the notion of aperiodicity measure for in nite symbolic sequences. Informally speaking, the aperiodicity measure of a sequence is the maximum number (between 0 and 1) such that this sequence di ers from each of its non-identical shifts in at least fraction of symbols being this number. We give lower and upper bounds on the aperiodicity measure of a sequence over a xed alphabet. We ...
متن کاملInformation measures for infinite sequences
We revisit the notion of computational depth and sophistication for infinite sequences and study the density of the sets of deep and sophisticated infinite sequences. Koppel defined the sophistication of an object as the length of the shortest total program that given some data as input produces it and the sum of the size of the program with the size of the data is as consice as the smallest de...
متن کاملApproximate Word Matches between Two Random Sequences
Given two sequences over a finite alphabet L, the D2 statistic is the number of m-letter word matches between the two sequences. This statistic is used in bioinformatics for expressed sequence tag database searches. Here we study a generalization of the D2 statistic in the context of DNA sequences, under the assumption of strand symmetric Bernoulli text. For k <m, we look at the count of m-lett...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 1974
ISSN: 0001-8708
DOI: 10.1016/0001-8708(74)90035-8